A Generalization of Multidimensional Synchronous Dataflow to Arbitrary Sampling Lattices
نویسندگان
چکیده
Multidimensional Synchronous Dataflow (MDSDF) [15][7] is a model of computation that has been proposed for specifying multidimensional multirate signal processing systems such as image and video processing algorithms. The model is an extension of synchronous dataflow (SDF) [14] and has all of the desirable properties of the SDF model such as static schedulability, exposition of data and functional parallelism, and a visually pleasing syntax well suited for block diagram signal processing environments such as Ptolemy [6] and Khoros [13]. However, the MDSDF model as specified in [15] is limited to modelling multidimensional systems sampled on the standard rectangular lattice. Since many multidimensional signals of practical interest are sampled on non-rectangular lattices, for example, 2:1 interlaced video signals, and many multidimensional multirate systems use non-rectangular multirate operators like hexagonal decimators, it is of interest to have models that are capable of representing and simulating such systems. This report describes an extension of the MDSDF model that allows signals on arbitrary sampling lattices to be represented, and that allows the use of non-rectangular downsamplers and upsamplers.
منابع مشابه
An extension of multidimensional synchronous dataflow to handle arbitrary sampling lattices
Multidimensional Synchronous Dataflow (MDSDF) [5][2] is a model of computation that has been proposed and implemented for specifying multidimensional multirate signal processing systems such as image and video processing algorithms. The model is an extension of synchronous dataflow (SDF) [4] and has all of the desirable properties of the SDF model such as static schedulability, exposure of data...
متن کاملMultidimensional synchronous dataflow
Signal flow graphs with dataflow semantics have been used in signal processing system simulation, algorithm development, and real-time system design. Dataflow semantics implicitly expose function parallelism by imposing only a partial ordering constraint on the execution of functions. One particular form of dataflow, synchronous dataflow (SDF) has been quite popular in programming environments ...
متن کاملDynamic and Multidimensional Dataflow Graphs
Much of the work to date on data ow models for signal processing system design has focused decidable data ow models that are best suited for onedimensional signal processing. In this chapter, we review more general data ow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic data ow behavior. As data ow techniques are applied to signa...
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کاملParameterized dataflow modeling of DSP systems
Dataflow has proven to be an attractive computation model for programming DSP applications. A restricted version of dataflow, termed synchronous dataflow (SDF), that offers strong compiletime predictability properties, but has limited expressive power, has been studied extensively in the DSP context [3]. Many extensions to synchronous dataflow have been proposed to increase its expressivity, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995